A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters

نویسندگان

  • Luiz Duczmal
  • Renato Assunção
چکیده

We propose a new graph based strategy for the detection of spatial clusters of arbitrary geometric form in a map of geo-referenced populations and cases. Our test statistic is based on the likelihood ratio test previously formulated by Kulldorff and Nagarwalla for circular clusters. A new technique of adaptive simulated annealing is developed, focused on the problem of finding the local maxima of a certain likelihood function over the space of the connected subgraphs of the graph associated to the regions of interest. Given a map with n regions, on average this algorithm finds a quasi-optimal solution after analyzing s n log(n) subgraphs, where s depends on the cases density uniformity in the map. The algorithm is applied to a study of homicide clusters detection in a Brazilian large metropolitan area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of spatial scan statistics for irregularly shaped disease clusters

Spatial scan statistics are commonly used for geographic disease cluster detection and evaluation. We propose and implement a modified version of the simulated annealing spatial scan statistic that incorporates the concept of “non-compactness” in order to penalize clusters that are very irregular in shape. We evaluate its power for the simulated annealing scan and compare it with the circular a...

متن کامل

A Simulated Annealing Strategy for Cluster Detection

We discuss and implement a new strategy for spatial cluster detection. A test statistic based on the likelihood ratio is used, as formulated by Kulldorff and Nagarwalla. Differently from these authors, our test is not restricted to the detection of clusters with fixed shape, such as rectangular or circular shape, but it looks for connected clusters with arbitrary geometry. This could be advanta...

متن کامل

A New Hybrid Routing Algorithm based on Genetic Algorithm and Simulated Annealing for Vehicular Ad hoc Networks

In recent years, Vehicular Ad-hoc Networks (VANET) as an emerging technology have tried to reduce road damage and car accidents through intelligent traffic controlling. In these networks, the rapid movement of vehicles, topology dynamics, and the limitations of network resources engender critical challenges in the routing process. Therefore, providing a stable and reliable routing algorithm is ...

متن کامل

Genetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy

This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computational Statistics & Data Analysis

دوره 45  شماره 

صفحات  -

تاریخ انتشار 2004